Efficient storage and retrieval of localized software resource data

ABSTRACT

A method of and system of for compressing and decompressing a localized software resource is disclosed. The method may include receiving a software resource, the software resource being in a first language, receiving a localized software resource for compression, where the software resource in the first language is a counterpart of the localized software resource in the second language. Upon receiving the software resources creating a first local dictionary for the localized software resource based at least in part on one or more first language words in the software resource and on data from a global dictionary, and compressing the localized software resource based on the local dictionary.

TECHNICAL FIELD

This disclosure relates generally to data compression, moreparticularly, to an improved method of and system for compressingsoftware resources.

BACKGROUND

Many software applications include large quantities of resource data(e.g., resource strings). For example, many applications store stringsthat need to be displayed in a user-interface of the application. Aresource file is typically used to store the resource strings for anapplication or suite of applications. The resource file may be accessedat runtime by other components of the application when a particularresource string or set of strings is needed for display in a userinterface. Because of the number of resource files used in complexsoftware applications, the total size of the resource files maycontribute significantly to the size of the final application. This maybe especially true for applications that provide support for languagelocalization for a given menu label or other user interface elements. Ifa string has to be available in many different languages, the numberand/or size of the resource files may significantly increase leading tolarger applications. As a result, it may be advantageous to usecompression techniques to reduce the size of resource files used in anapplication.

Reduced size resource files may be particularly useful when faced withbandwidth and storage constraints encountered when provisioning anddelivering an application. For example, a reduced file size may makedownloading an application package faster than it otherwise would be. Inaddition, the reduced file size may require less local storage spaceonce it has been downloaded to a local environment.

While a variety of compression technologies exist for compressing textfiles, many are not well suited to compressing relatively short textstrings, such as a resource string. Furthermore, compression techniquesthat are used for compressing short text strings are often not tailoredto compressing the same resource strings in different languages.

Hence, there is a need for an improved method and system compressing anddecompressing resource data.

SUMMARY

In one general aspect, the instant disclosure presents a device having aprocessor and a memory in communication with the processor where thememory comprises executable instructions that, when executed by theprocessors, cause the device to perform multiple functions. The functionmay include receiving a software resource, the software resource beingin a first language, receiving a localized software resource forcompression, the localized software resource being in a second language,where the software resource in the first language is a counterpart ofthe localized software resource, creating a first local dictionary forthe localized software resource based at least in part on one or morefirst language words in the software resource and on data from a globaldictionary, and compressing the localized software resource based on thelocal dictionary.

In yet another general aspect, the instant application describes amethod for compressing a localized software resource. The method mayinclude receiving a software resource, the software resource being in afirst language, receiving a localized software resource for compression,the localized software resource being in a second language, where thesoftware resource in the first language is a counterpart of thelocalized software resource, creating a first local dictionary for thelocalized software resource based at least in part on one or more firstlanguage words in the software resource and on data from a globaldictionary, and compressing the localized software resource based on thelocal dictionary.

In a further general aspect, the instant application describes anon-transitory computer readable medium on which are stored instructionsthat when executed cause a programmable device to receive a localizedsoftware resource for compression, the localized software resource beingin a second language, where the software resource in the first languageis a counterpart of the localized software resource, create a firstlocal dictionary for the localized software resource based at least inpart on one or more first language words in the software resource and ondata from a global dictionary, and compress the localized softwareresource based on the local dictionary.

This Summary is provided to introduce a selection of concepts in asimplified form that are further described below in the DetailedDescription. This Summary is not intended to identify key features oressential features of the claimed subject matter, nor is it intended tobe used to limit the scope of the claimed subject matter. Furthermore,the claimed subject matter is not limited to implementations that solveany or all disadvantages noted in any part of this disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

The drawing figures depict one or more implementations in accord withthe present teachings, by way of example only, not by way of limitation.In the figures, like reference numerals refer to the same or similarelements. Furthermore, it should be understood that the drawings are notnecessarily to scale.

FIG. 1 depicts an example operational architecture upon which aspects ofthis disclosure may be implemented.

FIG. 2 is a flow diagram for reducing the size of one or more resourcefiles of an application.

FIGS. 3A-3B are flow diagrams for creating a shared dictionary which maybe used in compressing resource files.

FIG. 4 is a flow diagram depicting an example method for creating aresource dictionary for use in reducing the size of one or more resourcefiles of an application.

FIG. 5 is a flow diagram depicting an example method for compressing alocalized resource.

FIG. 6 is a flow diagram depicting an example method for decompressing alocalized resource for an application.

FIG. 7 is a block diagram illustrating an example software architecture,various portions of which may be used in conjunction with varioushardware architectures herein described.

FIG. 8 is a block diagram illustrating components of an example machineconfigured to read instructions from a machine-readable medium andperform any of the features described herein.

DETAILED DESCRIPTION

In the following detailed description, numerous specific details are setforth by way of examples in order to provide a thorough understanding ofthe relevant teachings. It will be apparent to persons of ordinaryskill, upon reading this description, that various aspects can bepracticed without such details. In other instances, well known methods,procedures, components, and/or circuitry have been described at arelatively high-level, without detail, in order to avoid unnecessarilyobscuring aspects of the present teachings.

In today's computing environments, many software applications arelocalized in several different languages. For example, some MicrosoftOffice® applications are localized in more than 100 languages. Manysoftware applications store resource strings that need to be displayedin a user-interface of the application in a resource file. When manydifferent languages are used to localize an application, resourcestrings for all of those languages may need to be stored in separateresource files. This may result in an application having numerousresource files that take up a large amount of space. As an example,resources of one language may take about 100 MB of space in oneapplication. Thus, when multiple languages are offered, resources forall the languages may take a significantly large amount of disk space.This space may sometimes be even larger than the amount of spacerequired for an application itself. The large amount of space requiredcan lead to inefficient deployments, prohibitive memory spacerequirements, and in general increased footprint for an application.

Presently available processes for data compression are often nottailored to compressing short strings such as resource strings used forsoftware applications. Furthermore, data compression techniques thatwork on short strings do not take into account specific characteristicsof resource strings in different languages. As a result, none of thecurrently available data compression techniques offer highly efficientcompression and decompression for resource strings in differentlanguages.

To address these technical problems and more, in an example, thisdescription provides a technical solution for an efficient method ofcompressing localized software application resources. To improve thecurrent methods of data compression, the technical solution provides atranslational similarity compression technique which utilizes thestructure of a localized resource file to achieve a high compressionratio. The compression technique may make use of resources in a firstlanguage such as English as a base for compression and decompression ofresources in other languages. This is because English resources areoften available on client devices and contain valuable information thatcould be used for compression of translations. By using resources in afirst language as a base along with a generic translation dictionary foreach language, resources in other languages can be significantlycompressed. Thus, the technical solution offers a very efficientmechanism for compressing localized software application resources.

As will be understood by persons of skill in the art upon reading thisdisclosure, benefits and advantages provided by such technical solutionscan include, but are not limited to, a solution to the technicalproblems of inefficient, resource-intensive storage and deployment ofsoftware applications. Technical solutions and implementations providedherein optimize and improve the process of compressing, storing andaccessing localized software application resources. The benefitsprovided by these technical solutions include providing increasedefficiency in deployment and storage of software application, and assuch can result in improvements in computer devices which make use ofsoftware applications that utilize the technical solutions.

FIG. 1 illustrates an example operational architecture 100, pon whichaspects of this disclosure may be implemented. The system 100 mayinclude a build platform 105 on which a build environment 110 may behosted. The build environment 110 may be utilized to build anapplication 115. Application 115 may include a variety of elements thattogether form a program or suite of programs, non-limiting examples ofwhich are represented by one or more resource files 120 and code 125.Various processes may be carried out in build environment 110 withrespect to application 115 in order to produce an application package,such as compiling code, packaging binary code, running automated tests.

As part of building the application 115, build environment 110 mayinclude compression processes 130, which may be applied to elements ofapplication 115. In an example, the compression processes 130 may beapplied to one or more of resource files 120 and may include atranslational compression process 135 to reduce the size of at least oneresource file 107, as is discussed in more detail below.

Once an application is developed, an application package 140, which mayinclude the resource files 120 and code 125 may be uploaded or otherwiseprovided to service platform 145. The application provisioning service150 may then distribute the application package 140 in any of a varietyof ways to runtime platforms for local execution. Runtime platform 155is representative of one such local execution platform. For example,application package 140 may be downloaded to runtime platform 155 andinstalled as a local application 165 in a runtime environment 160. Inanother example, application package 140 may be streamed into runtimeenvironment 160. Alternatively, the application package may beprovisioned as a web application that executes in the context of abrowser application's runtime environment. It should be noted that whileshown separately, the build environment 110 may be integrated with theservice platform 145 and/or application provisioning service 150.

In the runtime environment 160, the contents of resource files 120 maybe decompressed and/or decoded at runtime, as resources stored thereinare accessed by executing components of the code 125. In particular,resource files 120 may include at least one resource file in whichresource strings are stored. When needed, relevant strings are retrievedfrom the resource file, decompressed and decoded, and surfaced in a userinterface of the local application 135.

In an implementation, the compression processes 130 include atranslational similarity compression technique directed to compressinglocalized software resources using resources in a first language such asEnglish as a base for compressing resources in other languages. Englishis used as a primary example of a first language in this disclosurebecause English often acts as the default fallback language at runtime.Thus, any time English resources are mentioned in this disclosure, itshould be understood that any other language may function as the baselanguage instead of English. Furthermore, in one implementation, a chainof languages may be used as the base language. For example, becauseSpanish-Mexico (es-MX) is similar to Spanish-Spain (es-SP), the es-MXlocale could be a subset of es-SP resources. This may mean that visiblees-MX are translated, while the rest remain in es-SP. In such a case,two languages may be used for deploying a software product (e.g., es-SPand English). In such a case, to compress es-MX resources efficiently,es-SP may be used as the base language, and then es-SP resources may becompressed with English (e.g., en-US) as the base. To decompress, firstes-SP may be decompressed and then es-MX from the decompressed es-SP.

Referring back to English as the base language, English resources may beavailable at deployment and often contain valuable information that canbe used for compression of translations. For example, English resourcesmay contain information regarding the set of words that will likelyappear in the translation of a resource, information about punctuation,placeholders and other non-translatable fragments that may migrate intothe translation, and other linguistic information (e.g., capitalization,punctuation, etc.). Because all of this information is already availablein the English resource, and because some of the information correspondsdirectly to the corresponding information in other languages, a largeamount of memory space may be saved by simply using the English resourceas the basis for looking up a corresponding resource (e.g., translationof the English resource) in another language.

A resource file may include content (e.g., resource strings), offsets(e.g., pointers) to content, and identifiers for the content. A resourcestring may be a short text string that has a specific identifier. In oneimplementation, application code can obtain the resource string from adatabase source (e.g., a database file) that provides for lookup ofresources by their identifiers. When a resource string is available inmore than one language, the same identifier may be used for the resourcestring in more than one language. For example, both the English resourcestring “Save a copy” and its corresponding Spanish resource string“Guardar una copia” may have the same identifier, even if they are savedin different resource files. Table 1 provides an example of dataavailable for two separate resource files corresponding to the Englishand Spanish phrases mentioned above.

TABLE 1 File Name Identifier Offset Content resources.en-us 0x00000001 8Save a copy resources.sp-sp 0x00000001 8 Guardar una copia

As shown in Table 1, even though the content of the filesresources.en.us and resources.sp-sp are different, the same identifierand the same offset may be used for the English string and itscorresponding translation into Spanish.

As discussed above, an English resource may be used to compress acorresponding localized resource in a different language. As asimplified example, the resource string “Save a copy” can be used tocompress the corresponding Spanish resource string “Guardar una copia”.This is because the English string includes the set of words that needto be translated to create the Spanish resource, in addition to thelinguistic information needed for completing the translation, such as,capitalizing the first word in the phrase, spaces between the words, andnot adding any punctuation marks at the end of the sentence. Because thelinguistic information in this Spanish string corresponds to (e.g., isthe same as) the linguistic information in the English resource, use ofthe English resource can significantly decrease the memory spacerequired for storing the Spanish resource. As a result, to compress theSpanish resource, a generic English-Spanish translation dictionary maybe used. This dictionary may be a generic dictionary that is shared forall applications and/or deployed with the operating system or adevelopment platform. Additionally, the dictionary can be created forevery resource file. Because the phrase “Guardar una copia” contains allthe words in the same places as its English counterpart phrase, thegeneric translation dictionary can be used to encode it. By utilizingthe generic translation dictionary and using indexes from the localdictionary, the whole phrase could be encoded in 6 bits as 000110. Table2 illustrates example bits required for encoding the Spanish phrase.

TABLE 2 English Index Index Spanish Word (Dec) (Bin) Word save 0 00guardar a 1 01 una copy 2 10 copia

It should be noted that the number of bits for indexes of a resource mayvary. For example, if the dictionary contains 8 words, then 3 bits maybe necessary for indexes. The number of necessary bits may be a part ofthe compressed data and as such may take 4 bits by itself. This may beunavoidable because not all English phrases contain all necessarySpanish words. As a result, the local dictionary size may not bepredictable by the English text alone.

In the example phrase used above, the 4 bits of bitness are 0010 (2 indecimal). Thus, the compressed data may fit into a total of 10 bits:0010000110. In this example, the Spanish phrase is so similar to itscorresponding English phrase (e.g., in terms of the number of words,linguistic information, etc.) that the phrase may be compressed withonly the bitness information as 0000. This may mean that no bits arenecessary for indexing, since the words are in the same places in boththe English and Spanish phrases. As a result, the compressed phrase“Guardar una copia” may require merely 4 bits of storage (e.g., ½ byte).This means that 34 bytes of a unicode string may be compressed to half abyte, thus resulting in significant size reduction.

In one implementation, to decompress the phrase, the following steps maybe taken. First, a local dictionary from the English phrase “Save acopy” may be created by splitting the phrase into the words that make upthe phrase (e.g., “save” “a” “copy”). Next, the linguistic informationfrom the English phrase may be collected, before translations for eachof the words in the phrase are looked up in the translation dictionary.Once the Spanish words are identified, they may be positioned at theirindexes, before linguistic information from the English resource isapplied to recreate the entire Spanish resource. In this manner, thecompressed resource string can be quickly and efficiently decompressedby the technical solution.

FIG. 2 is a flow diagram depicting an example method 200 for reducingthe size of one or more resource files of an application. At 202, method200 may begin by receiving a request to compress resource data. Therequest may be received as part of the application build process fromone or more elements of the build environment. In one implementation,the request may include one or more localized resources along with theircorresponding English counterparts for compression. Once a request isreceived, method 200 may proceed to prepare the data by first removingcontent identified as duplicate, at 204. This may be required because itis common to have duplicate resources in an application. In buildingresources for an application, a new resource is often created for everyoccasion even if the content of the resource is the same. For example,two different user interface elements may not use the same resource evenif the content of the resource string is the same. This may result in alarge amount of duplicate content in an application. In oneimplementation, once the duplicate content is identified, it is removedfrom the list of resource data that is being compressed by pointing theoffset to the first appearance of the same content and removing theduplicate content from the list. Table 3 provides an example of suchremoval for the content “Save a copy.”

TABLE 3 Identifier Offset Content 0x00000001 8 Save a copy 0x12341234 8

If there are multiple resource strings for the phrase “Save a copy,” thefirst occurrence may be added to the list, while for the remainingoccurrences, the offset is equated to the offset of the first occurrenceand the content is removed. This may ensure a resource string is onlyexamined and added to the compressed resource data once.

Once all duplicate content is removed from the list of resource data,method 200 may proceed to remove English resources identified inlocalized resources, at 206. This is because not all content in thelocalized resources requires translation into every localized language.For example, the phrase “Microsoft Word” may be translated in somelanguages and remain English in others. However, storing the samecontent in multiple languages is unnecessary and repetitive. Thus, whenEnglish phrases are identified in localized resources, they may beremoved if they are identified as a replica of an English resourcealready on the list. This may be done by removing the content and thenthe identifier from the source file. Table 4 illustrates an example ofremoving the phrase “Microsoft Word” from a Spanish resource file.

TABLE 4 File Identifier Offset Content resources.en-us 0x00000034 120Microsoft Word resources.sp-sp

As a result of the removal, resource strings that include replicatedEnglish content may remain in English resource files and be removed fromthe localized resource files. In one implementation, duringdecompression, they may be obtained through a resource fallbackmechanism. Because the translational compression mechanism discussedherein relies on English resources, the compression mechanism mayfallback to English when a resource identifier does not exist in alocalized file.

Once all duplicate localized and English content has been removed,method 200 may proceed to create a shared (global) dictionary for useduring compression and decompression, at 208. In one implementation, theshared dictionary may be a generic dictionary for translating words fromEnglish to another language. However, to ensure efficiency the termsavailable in the dictionary may be limited to terms used inlocalization. In an example, the shared dictionary is created fromEnglish and localized content in an application. The shared dictionarymay contain one or more translations per English word. It could alsocontain linguistic variants, for example translations with differentcase endings. The shared dictionary can be shared between a set ofapplications (e.g., a set of software products). In one implementationthe shared dictionary can be shared between all products created by acompany. For example, the shared dictionary may be offered as part adevelopment platform, such as .NET, or a part of an operating system asa language data. The process of preparing a shared dictionary isdescribed in detail below with regards to the steps of method 300 ofFIGS. 3A-3B.

After creating the shared dictionary, method 200 may proceed to generatea file dictionary, at 210. The file dictionary may be a dictionary thatis stored and used by one resource file. A resource file may have a needfor a file dictionary in addition to the shared dictionary when resourcefile contains rare terms or uncommon translations that are not coveredby the shared dictionary. In one implementation, the file dictionary maybecome necessary if a shared dictionary is not provided. The filedictionary may be part of the compressed data of a file. As a result,use and storage of a file dictionary may negatively affect thecompression ratio. In one implementation, shared and file dictionarieshave the same structure and may only be different in the location inwhich they are stored. A shared dictionary may be in a shared locationfor many applications, while the file dictionary may be stored in aresource file for use of that file alone. In one implementation, thefile dictionary is combined with the shared dictionary (e.g., added tothe end of the shared dictionary) and indexed together.

Once both the shared dictionary and any needed file dictionary arecreated, method 200 may develop a resource dictionary for each resourcein the resource data, at 212. A resource dictionary may contain Englishwords and translations that appear in an individual resource string. Theprocess for creating a resource dictionary is discussed in detail belowwith regards to method 400 of FIG. 4. Once all required dictionaries areprepared, method 200 may proceed to perform data compression on eachresource string, at 214, as discussed with regards to method 500 of FIG.5.

After data compression has been completed, method 200 may proceed toperform deduplication on the compressed resources, at 216. That isbecause in a short dictionary the compressed data may contain a set ofindexes. These indexes may be similar with each other regardless of thecontent they represent. For example, if a resource dictionary has 2words, then the compressed data may be either 0, 1 or 1, 0 for allresources in the dictionary. As a result, many compressed resources willbe the same and as such duplicated may be eliminated. Because of this,de-duplication after compression may reduce the number of recordssignificantly. In an example, deduplication after compression reducesthe number of records by about 25%. This results in reduced file sizesand helps the technical solution achieve an even higher compressionratio.

FIGS. 3A-3B are flow diagrams depicting an example method 300 forcreating a shared dictionary which may be used in compressing resourcefiles. At 302, method 300 may begin by receiving a request to create ashare dictionary. The request may be received from method 200 of FIG. 2as part of the process of compressing resource files of an application.After receiving the request, method 300 may proceed to first identify alocalized resource in a list of localized resources that need to becompressed, at 304. Once a first candidate localized resource has beenidentified, the content of the localized resource may be divided intothe words that make up the resource, at 306, before each separate wordof the content is paired with an English translation of the word, at308. Each pair is then collected into a list of pairs that make up thedictionary, at 310. A counter is set to 1 for each pair in the list, at312, when the first pair is collected. For each repeated pair in thelist, the counter may be increased by one and the duplicate pair may beremoved, at 314. In this manner, even if one or more words are repeatedin the resource, only one pair is stored in the list for each set ofwords.

After each word in the identified resource is paired with an Englishtranslation, method 300 may proceed to determine if there are any moreresources in the resource data, at 316. This may involve examiningvarious resource strings in different resource files to determine ifeach resource string has been processed according to the steps of method300. When more resource strings are identified, at 316, method 300 mayreturn to step 306 to divide the identified resource into its words andcontinue the process of creating pairs of English and translated words.

When all resources have been processed in this manner, method 300 maydetermine, at 316, that no other resources can be identified, in whichcase, it may proceed to sort the pairs that have been generated in theprevious steps by the number of their occurrence, at 318. Once, allgenerated pairs have been sorted such that those with higher occurrencesare at the top of the list (e.g., a pair that occurs more than anyothers in the list is the first in the list), method 300 may proceed tostep 330 of FIG. 3B, at 320.

Method 300 may continue, at 330, by selecting the pair with the highestoccurrence. The selected pair may be added to the dictionary by addingthe English word of the pair to a list of used English words in thedictionary, at 332, before adding the corresponding translated word ofthe pair to a list of used translated words in the dictionary, at 334.After the first pair has been added to the dictionary, method 300 maydetermine if there are any other pairs in the sorted list of pairs, at336.

When more pairs are identified, at 336, method 300 may select the nextpair with the highest occurrence, at 338. The selected pair may then beexamined to determine if either the English word or the translated wordare a duplicate of a word already in the list of used English words orthe list of used translated words, at 340. When both words in theselected pairs are identified as not being a duplicate, method 300 mayreturn to step 332 to add the English word to the list of English wordsin the dictionary, before proceeding to step 334. When the English wordis determined to a be duplicate, but the translation is not, method 300may instead return to step 334 to only add the translation to the list.However, if only the translation is determined to be a duplicate, method300 may return to step 332 to add the English word to the list, but mayskip step 334.

When it determined that both words in the pair are duplicates or when noother pairs are identified at step 336, method 300 may proceed toidentify localized words in the resource content that have no Englishcounterparts, at 342. This is because in some cases, even if words inEnglish resources and corresponding localized languages are paired, somelocalized words may remain without an English counterpart. To ensurecompleteness, these words may be added to a list of localized words, at344. In this manner, method 300 may ensure that all words that exist inlocalized resources appear either in the translation dictionary or inthe list of localized words without identified translation.

Once the list of localized words without translations has been created,this list may be combined with the dictionary, at 346. The combined listmay then be sorted by the number of occurrences, at 348. The sorted listmay then be indexed, at 350, to complete the shared dictionary. Bysorting the list first before indexing it, method 300 may ensure thatmost frequently used words correspond with smaller indexes. In oneimplementation, if a shared dictionary is used by more than one resourcefile, then the dictionary may be indexed such that the list ofnon-shared words is indexed after the list of shared words.

In this manner, a shared dictionary may be generated in which oneEnglish word corresponds to a localized word. This may create abilingual dictionary with limited words which may include pairs of wordsin a first language and a second language that appear most oftentogether. In one implementation, the process of method 300 may berepeated for rejected pairs for some languages. This may create adictionary with more than one translation corresponding to an Englishword. Reject pairs may refer to pairs of words that are put together butare determined to not have a likelihood of belonging with each other.For example, for two English strings “one car” and “a car” which mayboth have the translation “un coche”, the following table 5 illustratesthe list of words that may be paired together as a trial and whether ornot the pairing is accepted by the algorithm.

TABLE 5 English Spanish Frequency Accepted/rejected one un 1 acceptedone coche 1 rejected car un 1 rejected car coche 2 accepted a un 1rejected a coche 1 rejected

Based on the frequency of appearances, method 300 may determine that theword “car” likely corresponds to the word “coche” in Spanish. This pairis thus accepted as a pair. The first pair in the list may also beaccepted simply because it is the first in the table. However, the otherpairs are rejected because the English words “un” and “coche” arealready taken. To ensure that the dictionary does not miss importantwords, method 300 may be repeated for these rejected pairs by utilizingan existing dictionary as an input. The existing dictionary maydetermine that “a” corresponds with “un.” Since this pair is not alreadyin the shared dictionary, it may be added a pair to the dictionary.

Thus, method 300 may create a shared global bilingual dictionary thancan be shared between different resource files, different applicationsand/or different products. The shared dictionary may function like abilingual dictionary, but may contain limited terms since the terms andtranslations used are often restricted to those common in localization.

FIG. 4 is a flow diagram depicting an example method 400 for creating aresource (local) dictionary for use in reducing the size of one or moreresource files of an application. In an implementation, the resourcedictionary may be a local dictionary used for a specific resource file.At 402, method 400 may begin by receiving a request to create a resourcedictionary for a given localized resource. For example, the request maybe received as part of the process of method 200 for compressing one ormore localized resources of an application. After receiving the request,method 400 may identify the English resource that corresponds to thegiven localized resource for which the resource dictionary is beingcreated, at 404. Once the English resource is identified, it may bedivided into the words that make up the English resource, at 406. In oneimplementation, a delimiter after a word may be treated as another word,unless the delimiter follows common rules of language. For example, ifthe delimiter is a space after a word, it may be disregarded, but acomma may be treated as a word.

After splitting the English resource into individual words, a resourcedictionary may be created from the English words, at 408. This may bedone by locating a corresponding translation for each English word inthe shared and/or file dictionary and creating the dictionary by pairingeach English word with its located translation. In one implementation,if an English word has more than one translation in the shareddictionary, all the available translations are added to the resourcedictionary. When no translations can be found for an English word, thenthe word may be added to the dictionary without a translation. Once eachEnglish word is paired with a translation to create a dictionary, thewords may be indexed, at 410. Table 6 illustrates such a resourcedictionary for the example resource string “|0 restauróa una versiónanterior” having the English counterpart “|0 restored to a previousversion.”

TABLE 6 English Word Translation Index (binary) |0 No translation 000restored restaurado 001 restored restauró 010 to Para 011 a A 100previous Anterior 101 version Version 110

The example source string “|0 restauró a una versión anterior” includesa placeholder “|0” which has a 1:1 match in the English counterpart.This placeholder is not a natural word but is a common placeholder inresource strings. In an example, there are two different ways such aplaceholder may be processed when creating a resource dictionary. First,it could be treated as a regular word, if it exists as a word in theshared dictionary. In such a case, it may appear as “|0” in English to“|0” in Spanish, and the same characters may be used to add it to theresource dictionary. However, if the placeholder is not available in theshared dictionary (e.g., because the translation is the same as theword, it was not added), then the word may be added to the resourcedictionary as not having a translation, as shown in Table 6.

The word “restored” in the example resource string “|0 restored to aprevious version” has two translations in the shared dictionary, namely“restauró” and “restaurado” As a result, both translations are added tothe dictionary. The word “una” in the Spanish resource string, however,does not have a corresponding English word in the English counterpartresource string. That is because both words of the phrase “a una” havean English translation of “a”. To ensure this is handled properly, in animplementation, the method used to create a resource dictionary does notrequire a one to one correspondence between the English and localizedwords, as long as a counterpart word exits in the English content.Instead, the word “a” is used in the resource dictionary to point to oneof the two Spanish words “a una.” Alternatively, for a word having nocorresponding counterpart in the English counterpart string, the wordmay be added to the dictionary with a direct reference to the shareddictionary bypassing optimization of the resource dictionary for thatword.

Once the resource dictionary has been created based on the English wordsand their identified translations, the localized resource may be dividedinto the individual words that make up the string, at 412. For theexample resource string “10 restauró a una versión anterior” this mayinvolve creating a list that includes “10”, “restauró”, “a”, “versión”,and “anterior.”

Each individual word in the list may then be examined, at 414, todetermine if the word is included in the resource dictionary, at 416.This may be done by determining if the word is in the translation'scolumn of the English resource dictionary (table 5, column 2) or in theEnglish column (table 5, column 1).

When it is determined that a word is in the dictionary, method 400 mayskip the word, at 422, before proceeding to determine if any otherunexamined words remain in the localized resource, at 424. When moreunexamined words are identified, method 400 may return to step 414 toexamine them and determine if they are in the dictionary. When, however,it is determined that the examined word is not included in the resourcedictionary, method 400 may locate the word in the shared dictionary, at418. The word should exist in the shared dictionary because the shareddictionary combines both the generic bi-lingual dictionary and wordsthat are unique to a resource file. Once the word is located, the wordmay be added to the resource dictionary with a reference to its index inthe shared dictionary as the translation. In this manner, even if thecorrect translation is not initially identified for a word in thelocalized resource, the shared dictionary may still be used to compressthe word by using indexes as further discussed below. For the exampleresource string “|0 restauró a una versión anterior”, since the word“una” is not in the resource dictionary, it may be added to thedictionary with its index from the shared dictionary, resulting in theresource dictionary illustrated in table 7 below.

TABLE 7 English Local index Word Translation (binary) Global indexDictionary generated from English resource |0 No translation 000restored restaurado 001 restored restauró 010 to para 011 a a 100previous anterior 101 version versión 110 Words that are not in Englishresource una 111 100101100001 (decimal 2401)

Once the word is added, method 400 may proceed to step 424 to determineif there are any more words in the localized resource to be examined.When more words are identified, method 400 may return to step 414 torepeat the previous steps. If no unexamined words remain, then method400 may simple move to step 426 to end. By performing the above steps, acomplete resource dictionary may be created for each localized resourceusing the English resource.

FIG. 5 is a flow diagram depicting an example method 500 for compressinga localized resource. At 502, method 500 may begin by receiving arequest to compress a localized resource. After receiving request, thefirst few bits of the compressed localized resource may be set based onthe local indexes, at 504. In an example, the first four bits of thecompressed data may be set to the number of bits necessary for localindexes. This number is 0011 (3 in decimal) for the example localizedresource “|0 restauró a una versión anterior” because the maximum indexis 111 (in binary notation) and as such it may require 3 bits.

The localized resource may then be examined and divided into the wordsthat make up the localized resource, at 506. For each word in thelocalized resource, method 500 may try to find the word in the resourcedictionary (e.g., the resource dictionary corresponding to the localizedresource), at 508. Once the word is located in the resource dictionary,the local index for the word from the resource dictionary may be addedto the compressed resource, at 510. Method 500 may then proceed todetermine if the local index is in the range of missing words (e.g.,“una” which was missing from the original resource dictionary because itdid not have a corresponding word in the counterpart English phrase), at512. Because these words are added at the end of the resourcedictionary, it may be easy to determine if a word was a missing word bylooking at the range of indexes. This is important because, since thesewords do not have corresponding English counterparts, the index from theshared dictionary is being used for them. Thus, when it is determinedthat the word is a missing word, method 500 may proceed to calculateinformation from the shared and resource dictionary, at 514.

Calculating from information from the shared and resource dictionary mayinvolve multiple calculations. In one implementation, it includes firstcalculating the number of bits needed to store the bitness of the shareddictionary indexes. In general, bitness is the number of bits needed tostore a number of bits necessary for the maximum index. This may becalculated by identifying the maximum index of the shared dictionary anddetermining the number of bits necessary to store it. For example, ifthe shared dictionary has 50,000 entries (e.g., 50,000 words withtranslations), the indexes are in the range of 0 to 14,999. The maximumindex is thus 14,999 which is 11101010010111 in binary. By counting thenumber of bits in the maximum index, the bitness may be determined asbeing 14 bits. It should be noted that this number is a constant thatwill be known at decompression time. In one implementation, instead ofcalculating the bitness, a reasonable number may be selected and assumedfor all calculations. For example, it can be assumed that bitness is 16.This would limit the shared dictionary to 65,535, which may be a goodestimate for most applications.

Next, the number of bits necessary to store the maximum index calculatedfor bitness. In the example above, the number of bits was calculated as14 bits which is 1110 in binary format and as such requires 4 bits. Oncethis information is determined, method 500 may determine the number ofbits needed to store the maximum index from the resource dictionary(e.g., from table 6, column 4). In the example provided above, themaximum index is for the word “una” which is 100101100001, and thusrequires 12 bits.

The information calculated may be stored, at 516, by adding the numberof bits calculated for storing the maximum index and storing the valueof the number of bits needed to store the maximum index from theresource dictionary into the inserted bits. In the example above, thismay involve adding 4 bits to the compressed data and storing the number12 in those bits. Method 500 may then proceed to keep the index from theshared dictionary which was associated in the resource dictionary forthe missing word for future use. For the example above, this may involvestoring the index from table 6, column 4 for word “una” using the numberof bits (e.g., 12 bits) calculated above.

Once the calculations are done and the information is stored or when itis determined, at 512, that the word is not a missing word, method 500may proceed to determine if there are any other words in the localizedresource to examine and compress, at 520. When more words areidentified, method 500 may return to step 508 to find the word in theresource dictionary and continue with the previously described process.However, it should be noted that after the first time that bitness andmaximum number of bits necessary to store the maximum index calculatedfor bitness are calculated, those numbers may not need to be calculatedagain since their value remains constant. Instead, method 500 may simplyproceed to store the index from the shared dictionary that is located inthe resource dictionary, if the word is a missing word.

When it is determined, at 520, that no other uncompressed words remainin the localized resource, method 500 may proceed to add the globalindex from the resource dictionary using the number of bits calculatedabove (e.g., 12 bits for the above example), at 522.

For the example resource string “|0 restauró a una versión anterior,”following the compressions techniques of method 500 may lead to arrivingat 011 (bitness of local indexes), 000 (first word “|1”), 010 (word“restauró”), 100 (word “a”), 111 (word “una”), 1100 (since “una” is thefirst missing word), 110 (word “versión”, 101 (word “anterior”), and100101100001 (from the global indexes section of the resourcedictionary). The resulting compressed data is 011, 000, 010, 100, 111,1100, 110, 101, 100101100001. This requires 37 bits as opposed to 544bits required for the uncompressed phrase (2 bytes for each of 34characters times 8 bits). Thus, using the compression solution discussedherein results in significant reduction of size in localized resources.

In one implementation, it may be needed to also store the length of theresource string in the compressed data, for example if the length of thebinary block is unknown. In such an instant, the number of words may bestored, in on example, instead of the length. Because the count cannotexceed indexes plus one, the same number of bits may be necessary tostore the count. For example, if indexes require 3 bits, then the countof words is also 3 bits. The stored information may thus be equal to thenumber of words minus one. In one implementation, this number is storedright after the bitness. The updated binary may then be equal to is 011,110 (this information may be needed at the decompression stage to stopprocessing bits after 6 words) 000, 010, 100, 111, 1100, 110, 101,100101100001.

In one implementation, grammar, punctuation and other linguisticinformation is also taken into account when conducting a compression.For example, if words of the localized resource string are in the sameorder as that of the English resource, then the 4 bits of bitness may beset to 0000 and no other information may be needed for ordering thephrase during decompression. This may significantly reduce the amount ofdata, for example, for en-GB locale. When, however, the ordering orpunctuation is different, a variety of different mechanisms may be usedto take the differences into account. For example, when a localizedresource has a period and the counterpart English resource does not (orvice versa), then the period may be added at the end of the translation.For example, if the English resource is “Save a copy” and the Spanishresource is “Guardar una copia.”, then the Spanish string to compress is“Guardar una copia.” which includes the period. The period may betreated as an addition word that the English resource does not have.

In one implementation, at the decompression stage, the order may be setas the reverse of the English resource. For example, if the Englishresource has a punctuation and the compressed resource includes it, thenthe decompressed resource will not have it. As an example, for theEnglish resource “Save a copy.”, with a corresponding Spanish resourceas “Guardar una copia”, the Spanish string to compress may be “Guardaruna copia.” which includes the period. At decompression then because ofinversion, the period may be removed. In another example, if the Englishresource does not have the punctuation, but the compressed resource doeshave it, then decompressed resource will have the punctuation. In oneimplementation, this rule may also apply to spaces between words. If aspace is unnecessary in decompressed content, but the generic rulesuggests one, then a space may be added. If two or more spaces arenecessary, then two or more spaces may be added accordingly to thecompressed data.

FIG. 6 is a flow diagram depicting an example method 600 fordecompressing a localized resource for an application. At 602, method600 may begin by receiving a request to decompress a resource string.Method 600 may then receive the compressed resource, at 604, beforereceiving the uncompressed English counterpart of the compressedresource, at 606. In one implementation, the compressed resource may bereceived as part of the request to perform decompression. To performdecompression, the decompression method 600 may also receive or beprovided access to the shared dictionary and the file dictionary.

Once all the required information is received, method 600 may proceed tocreate a resource dictionary from the English resource dictionary, at608. This may be done in a similar manner as that discussed above formethod 400 of FIG. 4, in that the English resource is divided intoindividual words, and translations are retrieved from the shareddictionary for each English word. It should be noted that this resourcedictionary may be incomplete at this time because it is built solelybased on the English resource. For example, referring back to theexample localized resource “|0 restauró a una versión anterior,” theresource dictionary may not have the word “una” at this stage.

After the resource dictionary is created, method 600 may proceed to readthe bitness information from the first few bites of the compressedresource, at 610. This may provide the bitness information and maycontain the number of bits necessary to represent one word in thecompressed data. For example, referring back to the example resource “10restauró a una versión anterior,” the first three bits which are 011indicate that 3 bits are used for every word in the compressed string.This number may then be used to read the next 3 bits and so on toidentify and decompress the words.

Once the number of bits (N) that needs to be read for each next word isidentified, method 600 may proceed to read the next N bits to determinethe number of words in the compressed data, at 612. In the exampleabove, the next 3 bits read 110 which indicates there are 7 words in thelocalized resource. Next, the next N bits of the compressed resource isread, at 614. These next N bits may be the index of a word in theresource dictionary and as such point to a word in the localizedresource. For the example compressed data, the next 3 bits are 000 whichis the index for the word “|0” in the resource dictionary. Once theindex of a word in the compressed data is identified, method 600 maydetermine if the index is within the initial resource dictionary, at616. That is because, as discussed above, there may be words in thelocalized resource for which an English counterpart does not exist inthe English resource. These words may not exist in the currently usedresource dictionary as created at this stage of the decompression method600. As a result, if the index cannot be located within the resourcedictionary, it may indicate that the compressed resource includes one ormore indexes for the shared dictionary.

When the index is identified as not being within the resourcedictionary, method 600 proceeds to read the next few bits in thecompressed data which may indicate the bitness of the global index, at624. For the example resource, this may refer to reading the index 111which does not correspond with any English words and then reading thenext 4 bits (1100) which is the bitness (e.g., number of bits necessary)for the global index. Since this indicates that the localized resourceincludes a word for which a global index is provided, method 600 mayproceed to set a counter for the number global indexes in the compresseddata, at 626. The counter may be initially set to one and every time anew global index is identified, it may be increased by one.

When it is determined, however, at 616, that the index can be locatedwithin the resource dictionary, then method 600 may proceed to add atranslation from the resource dictionary to the decompressed resource.As an example, for the example resource above, upon reading the firstindex 000, the phrase “|0” may be added to the decompressed resource.Method 600 may then proceed to determine whether they are any unread Nbit words remains in the compressed resource which need to bedecompressed, at 620.

When it is determined that there are more words in the decompresseddata, method 600 may return to step 614 to read the next N bits andfollow the previous steps to decompress the word. When, however, it isdetermined that no other N bit words remain in the decompressed data,method 600 may proceed to read any global indexes available in thecompressed data and lookup and insert the word corresponding to theglobal index from the shared dictionary, at 622. This may be because,the global indexes are placed at the end of the compressed resource.Once all global indexes are read and their corresponding word looked upand inserted from the shared dictionary, method 600 may apply linguisticrules to the decompressed phrase, at 628. These rules may include spacesand punctuation rules and if needed rules described above for revertingpunctuations. In one implementation, the rules are applied based on therules derived from the counterpart English resource. For example, if thefirst word of the English resource is capitalized, the first word of thelocalized resource is also capitalized. In this manner, an entirelocalized resource can be quickly and efficiently decompressed to obtainthe original localized resource.

Thus, in different implementations, a technical solution is provided foran improved method and system of compressing and decompressing localizedresources for an application. The technical solution provides acompression mechanism for compressing localized resources by using theircounterpart English resource as a basis for compression anddecompression. Thus, the technical solution provides a highly efficientmechanism for compressing, storing, and decompressing resources of anapplication. In an example, the technical solution provides acompression ratio of 20 or higher with space savings of 95% to 99.5%.

FIG. 7 is a block diagram 700 illustrating an example softwarearchitecture 702, various portions of which may be used in conjunctionwith various hardware architectures herein described, which mayimplement any of the above-described features. FIG. 7 is a non-limitingexample of a software architecture and it will be appreciated that manyother architectures may be implemented to facilitate the functionalitydescribed herein. The software architecture 702 may execute on hardwaresuch as client devices, native application provider, web servers, serverclusters, external services, and other servers. A representativehardware layer 704 includes a processing unit 706 and associatedexecutable instructions 708. The executable instructions 708 representexecutable instructions of the software architecture 702, includingimplementation of the methods, modules and so forth described herein.

The hardware layer 704 also includes a memory/storage 710, which alsoincludes the executable instructions 708 and accompanying data. Thehardware layer 704 may also include other hardware modules 712.Instructions 708 held by processing unit 708 may be portions ofinstructions 708 held by the memory/storage 710.

The example software architecture 702 may be conceptualized as layers,each providing various functionality. For example, the softwarearchitecture 702 may include layers and components such as an operatingsystem (OS) 714, libraries 716, frameworks 718, applications 720, and apresentation layer 724. Operationally, the applications 720 and/or othercomponents within the layers may invoke API calls 724 to other layersand receive corresponding results 726. The layers illustrated arerepresentative in nature and other software architectures may includeadditional or different layers. For example, some mobile or specialpurpose operating systems may not provide the frameworks/middleware 718.

The OS 714 may manage hardware resources and provide common services.The OS 714 may include, for example, a kernel 728, services 730, anddrivers 732. The kernel 728 may act as an abstraction layer between thehardware layer 704 and other software layers. For example, the kernel728 may be responsible for memory management, processor management (forexample, scheduling), component management, networking, securitysettings, and so on. The services 730 may provide other common servicesfor the other software layers. The drivers 732 may be responsible forcontrolling or interfacing with the underlying hardware layer 704. Forinstance, the drivers 732 may include display drivers, camera drivers,memory/storage drivers, peripheral device drivers (for example, viaUniversal Serial Bus (USB)), network and/or wireless communicationdrivers, audio drivers, and so forth depending on the hardware and/orsoftware configuration.

The libraries 716 may provide a common infrastructure that may be usedby the applications 720 and/or other components and/or layers. Thelibraries 716 typically provide functionality for use by other softwaremodules to perform tasks, rather than rather than interacting directlywith the OS 714. The libraries 716 may include system libraries 734 (forexample, C standard library) that may provide functions such as memoryallocation, string manipulation, file operations. In addition, thelibraries 716 may include API libraries 736 such as media libraries (forexample, supporting presentation and manipulation of image, sound,and/or video data formats), graphics libraries (for example, an OpenGLlibrary for rendering 2D and 3D graphics on a display), databaselibraries (for example, SQLite or other relational database functions),and web libraries (for example, WebKit that may provide web browsingfunctionality). The libraries 716 may also include a wide variety ofother libraries 738 to provide many functions for applications 720 andother software modules.

The frameworks 718 (also sometimes referred to as middleware) provide ahigher-level common infrastructure that may be used by the applications720 and/or other software modules. For example, the frameworks 718 mayprovide various GUI functions, high-level resource management, orhigh-level location services. The frameworks 718 may provide a broadspectrum of other APIs for applications 720 and/or other softwaremodules.

The applications 720 include built-in applications 720 and/orthird-party applications 722. Examples of built-in applications 720 mayinclude, but are not limited to, a contacts application, a browserapplication, a location application, a media application, a messagingapplication, and/or a game application. Third-party applications 722 mayinclude any applications developed by an entity other than the vendor ofthe particular system. The applications 720 may use functions availablevia OS 714, libraries 716, frameworks 718, and presentation layer 724 tocreate user interfaces to interact with users.

Some software architectures use virtual machines, as illustrated by avirtual machine 728. The virtual machine 728 provides an executionenvironment where applications/modules can execute as if they wereexecuting on a hardware machine (such as the machine 800 of FIG. 8, forexample). The virtual machine 728 may be hosted by a host OS (forexample, OS 714) or hypervisor, and may have a virtual machine monitor726 which manages operation of the virtual machine 728 andinteroperation with the host operating system. A software architecture,which may be different from software architecture 702 outside of thevirtual machine, executes within the virtual machine 728 such as an OS750, libraries 752, frameworks 754, applications 756, and/or apresentation layer 758.

FIG. 8 is a block diagram illustrating components of an example machine800 configured to read instructions from a machine-readable medium (forexample, a machine-readable storage medium) and perform any of thefeatures described herein. The example machine 800 is in a form of acomputer system, within which instructions 816 (for example, in the formof software components) for causing the machine 800 to perform any ofthe features described herein may be executed. As such, the instructions816 may be used to implement methods or components described herein. Theinstructions 816 cause unprogrammed and/or unconfigured machine 800 tooperate as a particular machine configured to carry out the describedfeatures. The machine 800 may be configured to operate as a standalonedevice or may be coupled (for example, networked) to other machines. Ina networked deployment, the machine 800 may operate in the capacity of aserver machine or a client machine in a server-client networkenvironment, or as a node in a peer-to-peer or distributed networkenvironment. Machine 800 may be embodied as, for example, a servercomputer, a client computer, a personal computer (PC), a tabletcomputer, a laptop computer, a netbook, a set-top box (STB), a gamingand/or entertainment system, a smart phone, a mobile device, a wearabledevice (for example, a smart watch), and an Internet of Things (IoT)device. Further, although only a single machine 800 is illustrated, theterm “machine” include a collection of machines that individually orjointly execute the instructions 816.

The machine 800 may include processors 810, memory 830, and I/Ocomponents 850, which may be communicatively coupled via, for example, abus 802. The bus 802 may include multiple buses coupling variouselements of machine 800 via various bus technologies and protocols. Inan example, the processors 810 (including, for example, a centralprocessing unit (CPU), a graphics processing unit (GPU), a digitalsignal processor (DSP), an ASIC, or a suitable combination thereof) mayinclude one or more processors 812 a to 812 n that may execute theinstructions 816 and process data. In some examples, one or moreprocessors 810 may execute instructions provided or identified by one ormore other processors 810. The term “processor” includes a multi-coreprocessor including cores that may execute instructionscontemporaneously. Although FIG. 8 shows multiple processors, themachine 800 may include a single processor with a single core, a singleprocessor with multiple cores (for example, a multi-core processor),multiple processors each with a single core, multiple processors eachwith multiple cores, or any combination thereof. In some examples, themachine 800 may include multiple processors distributed among multiplemachines.

The memory/storage 830 may include a main memory 832, a static memory834, or other memory, and a storage unit 836, both accessible to theprocessors 810 such as via the bus 802. The storage unit 836 and memory832, 834 store instructions 816 embodying any one or more of thefunctions described herein. The memory/storage 830 may also storetemporary, intermediate, and/or long-term data for processors 810. Theinstructions 916 may also reside, completely or partially, within thememory 832, 834, within the storage unit 836, within at least one of theprocessors 810 (for example, within a command buffer or cache memory),within memory at least one of I/O components 850, or any suitablecombination thereof, during execution thereof. Accordingly, the memory832, 834, the storage unit 836, memory in processors 810, and memory inI/O components 850 are examples of machine-readable media.

As used herein, “machine-readable medium” refers to a device able totemporarily or permanently store instructions and data that causemachine 800 to operate in a specific fashion. The term “machine-readablemedium,” as used herein, does not encompass transitory electrical orelectromagnetic signals per se (such as on a carrier wave propagatingthrough a medium); the term “machine-readable medium” may therefore beconsidered tangible and non-transitory. Non-limiting examples of anon-transitory, tangible machine-readable medium may include, but arenot limited to, nonvolatile memory (such as flash memory or read-onlymemory (ROM)), volatile memory (such as a static random-access memory(RAM) or a dynamic RAM), buffer memory, cache memory, optical storagemedia, magnetic storage media and devices, network-accessible or cloudstorage, other types of storage, and/or any suitable combinationthereof. The term “machine-readable medium” applies to a single medium,or combination of multiple media, used to store instructions (forexample, instructions 816) for execution by a machine 800 such that theinstructions, when executed by one or more processors 810 of the machine800, cause the machine 800 to perform and one or more of the featuresdescribed herein. Accordingly, a “machine-readable medium” may refer toa single storage device, as well as “cloud-based” storage systems orstorage networks that include multiple storage apparatus or devices.

The I/O components 850 may include a wide variety of hardware componentsadapted to receive input, provide output, produce output, transmitinformation, exchange information, capture measurements, and so on. Thespecific I/O components 850 included in a particular machine will dependon the type and/or function of the machine. For example, mobile devicessuch as mobile phones may include a touch input device, whereas aheadless server or IoT device may not include such a touch input device.The particular examples of I/O components illustrated in FIG. 8 are inno way limiting, and other types of components may be included inmachine 800. The grouping of I/O components 850 are merely forsimplifying this discussion, and the grouping is in no way limiting. Invarious examples, the I/O components 850 may include user outputcomponents 852 and user input components 854. User output components 852may include, for example, display components for displaying information(for example, a liquid crystal display (LCD) or a projector), acousticcomponents (for example, speakers), haptic components (for example, avibratory motor or force-feedback device), and/or other signalgenerators. User input components 854 may include, for example,alphanumeric input components (for example, a keyboard or a touchscreen), pointing components (for example, a mouse device, a touchpad,or another pointing instrument), and/or tactile input components (forexample, a physical button or a touch screen that provides locationand/or force of touches or touch gestures) configured for receivingvarious user inputs, such as user commands and/or selections.

In some examples, the I/O components 850 may include biometriccomponents 856 and/or position components 862, among a wide array ofother environmental sensor components. The biometric components 856 mayinclude, for example, components to detect body expressions (forexample, facial expressions, vocal expressions, hand or body gestures,or eye tracking), measure biosignals (for example, heart rate or brainwaves), and identify a person (for example, via voice-, retina-, and/orfacial-based identification). The position components 862 may include,for example, location sensors (for example, a Global Position System(GPS) receiver), altitude sensors (for example, an air pressure sensorfrom which altitude may be derived), and/or orientation sensors (forexample, magnetometers).

The I/O components 850 may include communication components 864,implementing a wide variety of technologies operable to couple themachine 800 to network(s) 870 and/or device(s) 880 via respectivecommunicative couplings 872 and 882. The communication components 864may include one or more network interface components or other suitabledevices to interface with the network(s) 870. The communicationcomponents 864 may include, for example, components adapted to providewired communication, wireless communication, cellular communication,Near Field Communication (NFC), Bluetooth communication, Wi-Fi, and/orcommunication via other modalities. The device(s) 880 may include othermachines or various peripheral devices (for example, coupled via USB).

In some examples, the communication components 864 may detectidentifiers or include components adapted to detect identifiers. Forexample, the communication components 864 may include Radio FrequencyIdentification (RFID) tag readers, NFC detectors, optical sensors (forexample, one- or multi-dimensional bar codes, or other optical codes),and/or acoustic detectors (for example, microphones to identify taggedaudio signals). In some examples, location information may be determinedbased on information from the communication components 862, such as, butnot limited to, geo-location via Internet Protocol (IP) address,location via Wi-Fi, cellular, NFC, Bluetooth, or other wireless stationidentification and/or signal triangulation.

While various embodiments have been described, the description isintended to be exemplary, rather than limiting, and it is understoodthat many more embodiments and implementations are possible that arewithin the scope of the embodiments. Although many possible combinationsof features are shown in the accompanying figures and discussed in thisdetailed description, many other combinations of the disclosed featuresare possible. Any feature of any embodiment may be used in combinationwith or substituted for any other feature or element in any otherembodiment unless specifically restricted. Therefore, it will beunderstood that any of the features shown and/or discussed in thepresent disclosure may be implemented together in any suitablecombination. Accordingly, the embodiments are not to be restrictedexcept in light of the attached claims and their equivalents. Also,various modifications and changes may be made within the scope of theattached claims.

Generally, functions described herein (for example, the featuresillustrated in FIGS. 1-6) can be implemented using software, firmware,hardware (for example, fixed logic, finite state machines, and/or othercircuits), or a combination of these implementations. In the case of asoftware implementation, program code performs specified tasks whenexecuted on a processor (for example, a CPU or CPUs). The program codecan be stored in one or more machine-readable memory devices. Thefeatures of the techniques described herein are system-independent,meaning that the techniques may be implemented on a variety of computingsystems having a variety of processors. For example, implementations mayinclude an entity (for example, software) that causes hardware toperform operations, e.g., processors functional blocks, and so on. Forexample, a hardware device may include a machine-readable medium thatmay be configured to maintain instructions that cause the hardwaredevice, including an operating system executed thereon and associatedhardware, to perform operations. Thus, the instructions may function toconfigure an operating system and associated hardware to perform theoperations and thereby configure or otherwise adapt a hardware device toperform functions described above. The instructions may be provided bythe machine-readable medium through a variety of differentconfigurations to hardware elements that execute the instructions.

In the following, further features, characteristics and advantages ofthe invention will be described by means of items:

Item 1. A data processing system comprising:

a processor; and

a memory in communication with the processor, the memory comprisingexecutable instructions that, when executed by the processor, cause thedata processing system to perform functions of:

-   -   receiving a software resource, the software resource being in a        first language;    -   receiving a localized software resource for compression, the        localized software resource being in a second language, the        software resource in the first language being a counterpart of        the localized software resource;    -   creating a first local dictionary for the localized software        resource based at least in part on one or more first language        words in the software resource and on data from a global        dictionary; and    -   compressing the localized software resource based on the local        dictionary.

Item 2. The data processing system of item 1, wherein the executableinstructions when executed by the processor, further cause the device toperform functions of:

-   -   creating the global dictionary for an application by:        -   examining a plurality of localized software resources in the            application;        -   dividing each of the plurality of localized software            resources into one or more words that make up each localized            software resource;        -   pair each of the one or more words with a corresponding            first language word from a counterpart first language            software resource to obtain a plurality of pairs;        -   initiating a counter for each pair and setting the counter            to one;        -   if a pair is a repeat pair, increasing the counter by one;        -   sorting the plurality of pairs by occurrence;        -   selecting the pair with the highest occurrence;        -   adding the pair with the highest occurrence to the global            dictionary by adding the localized word from the pair to a            list of used localized words and adding the corresponding            first language word to a list of used first language words;            and        -   selecting a next pair with the highest occurrence and            repeating the process of adding the next pair to the global            dictionary for each of the plurality of pairs, unless the            localized word is in the list of used localized words or the            corresponding first language word is in the used first            language words list.

Item 3. The data processing system of items 1 or 2, wherein creating thefirst local dictionary includes:

-   -   dividing the first language software resource into one or more        words that make up the first language software resource;    -   pairing each of the one or more words with a translation        obtained from the global dictionary to obtain a plurality of        pairs to create a list of words in the local dictionary;    -   indexing the plurality of pairs;    -   dividing the localized software resource into one or more        localized words that make up the localized software resource;    -   determining if each of the one or more localized words are        included in at least one of the plurality of pairs;    -   when one of the one or more localized words are not included in        at least one of the plurality of pairs, locating an index for        the one of the one or more localized words in the global        dictionary; and    -   adding the one of the one or more localized words to the list of        words in the first local dictionary along with the index.

Item 4. The data processing system of any of the preceding items,wherein compressing the localized software resource based on the firstlocal dictionary includes:

-   -   setting a predetermined number of first bits in a compressed        localized resource to a number of bits necessary to store local        indexes;    -   dividing the localized software resource into one or more        localized words that make up the localized software resource;    -   for each of the one or more localized words, locating the word        in the first local dictionary and adding a local index that        corresponds to the word from the first local dictionary to the        compressed localized resource;    -   determining if the local index indicates the word does not        include a first language counterpart in the local dictionary;        and    -   upon determining the local index indicates the word does not        include the first language counterpart in the local dictionary,        adding a global index for the word from the global dictionary to        the compressed localized resource.

Item 5. The data processing system of any of the preceding items,wherein the executable instructions when executed by the processor,further cause the device to perform functions of decompressing thecompressed localized resource to obtain a decompressed localizedresource by:

-   -   creating a second local dictionary from the software resource in        the first language;    -   reading bitness information from the compressed localized        resource to determine a specific number of bits used for each        word in the compressed localized resource;    -   reading a next specific number of bits from the compressed        localized resource to determine a number of words in the        decompressed localized resource;    -   reading the next specific number of bits from the compressed        localized resource to determine if the next specific number of        bits corresponds to an index in the second local dictionary;    -   when the next specific number of bits corresponds with the        index, adding a translation corresponding to the index from the        local dictionary to the decompressed localized resource;    -   when the next specific number of bits does not correspond with        the index, reading a global index in the compressed localized        resource, locating the global index in the global dictionary and        inserting a translation corresponding to the global index in the        decompressed localized resource; and    -   applying linguistic rules to the decompressed localized        resource.

Item 6. The data processing system of any of the preceding items,wherein the executable instructions when executed by the processor,further cause the device to perform functions of removing duplicatecontent.

Item 7. The data processing system of any of the preceding items,wherein the executable instructions when executed by the processor,further cause the device to perform functions of removing first languagereplicas in the localized software resource.

Item 8. The data processing system of any of the preceding items,wherein the executable instructions when executed by the processor,further cause the device to perform functions of creating a filedictionary.

Item 9. The data processing system of any of the preceding items,wherein the executable instructions when executed by the processor,further cause the device to perform functions of performingdeduplication after compressing the localized software resource.

Item 10. A method for compressing a localized software resource,comprising:

-   -   receiving a software resource, the software resource being in a        first language;    -   receiving the localized software resource for compression, the        localized software resource being in a second language, the        software resource in the first language being a counterpart of        the localized software resource in the second language;    -   creating a local dictionary for the localized software resource        based at least in part on one or more first language words in        the software resource and based on data from a global        dictionary; and    -   compressing the localized software resource based on the local        dictionary.

Item 11. The method of item 10, further comprising creating the globaldictionary by:

-   -   examining a plurality of localized software resources in the        application;    -   dividing each of the plurality of localized software resources        into one or more words that make up each localized software        resource;    -   pair each of the one or more words with a corresponding first        language word from a counterpart first language resource to        obtain a plurality of pairs;    -   initiating a counter for each pair and setting the counter to        one;    -   if a pair is a repeat pair, increasing the counter by one;    -   sorting the plurality of pairs by occurrence;    -   selecting the pair with the highest occurrence;    -   adding the pair with the highest occurrence to the global        dictionary by adding the localized word from the pair to a list        of used localized words and adding the corresponding first        language word to a list of used first language words; and    -   selecting a next pair with the highest occurrence and repeating        the process of adding the next pair to the global dictionary for        each of the plurality of pairs, unless the localized word is in        the list of used localized words or the corresponding first        language word is in the used first language words list.

Item 12. The method of items 10 or 11, wherein creating the first localdictionary includes:

-   -   dividing the first language software resource into one or more        words that make up the first language software resource;    -   pairing each of the one or more words with a translation        obtained from the global dictionary to obtain a plurality of        pairs to create a list of words in the local dictionary;    -   indexing the plurality of pairs;    -   dividing the localized software resource into one or more        localized words that make up the localized software resource;    -   determining if each of the one or more localized words are        included in at least one of the plurality of pairs;    -   when one of the one or more localized words are not included in        at least one of the plurality of pairs, locating an index for        the one of the one or more localized words in the global        dictionary; and    -   adding the one of the one or more localized words to the list of        words in the first local dictionary along with the index.

Item 13. The method of any of items 10-12, wherein compressing thelocalized software resource based on the first local dictionaryincludes:

setting a predetermined number of first bits in a compressed localizedresource to a number of bits necessary to store local indexes;

dividing the localized software resource into one or more localizedwords that make up the localized software resource;

for each of the one or more localized words, locating the word in thefirst local dictionary and adding a local index that corresponds to theword from the first local dictionary to the compressed localizedresource;

determining if the local index indicates the word does not include afirst language counterpart in the local dictionary; and

upon determining the local index indicates the word does not include thefirst language counterpart in the local dictionary, adding a globalindex for the word from the global dictionary to the compressedlocalized resource.

Item 14. The method of any of the preceding items 10-13, furthercomprising decompressing the compressed localized resource to obtain adecompressed localized resource by:

creating a second local dictionary from the first language softwareresource;

reading bitness information from the compressed localized resource todetermine a specific number of bits used for each word in the compressedlocalized resource;

reading a next specific number of bits from the compressed localizedresource to determine a number of words in the decompressed localizedresource;

reading the next specific number of bits from the compressed localizedresource to determine if the next specific number of bits corresponds toan index in the second local dictionary;

when the next specific number of bits corresponds with the index, addinga translation corresponding to the index from the local dictionary tothe decompressed localized resource;

when the next specific number of bits does not correspond with theindex, reading a global index in the compressed localized resource,locating the global index in the global dictionary and inserting atranslation corresponding to the global index in the decompressedlocalized resource; and

applying linguistic rules to the decompressed localized resource.

Item 15. The method of any of the preceding items 10-14, furthercomprising creating a file dictionary.

Item 16. A non-transitory computer readable medium on which are storedinstructions that, when executed, cause a programmable device to:

receive a software resource, the software resource being in a firstlanguage;

receive a localized software resource for compression, the localizedsoftware resource being in a second language, the software resource inthe first language being a counterpart of the localized softwareresource in the second language;

create a local dictionary for the localized software resource based atleast in part on one or more first language words in the softwareresource and based on data from a global dictionary; and

compress the localized software resource based on the local dictionary.

Item 17. The computer readable medium of item 16, wherein theinstructions further cause the programmable device to create the globaldictionary for an application by:

examining a plurality of localized software resources in theapplication;

dividing each of the plurality of localized software resources into oneor more words that make up each localized software resource;

pair each of the one or more words with a corresponding first languageword from a counterpart first language resource to obtain a plurality ofpairs;

initiate a counter for each pair and setting the counter to one;

if a pair is a repeat pair, increase the counter by one;

sort the plurality of pairs by occurrence;

select the pair with the highest occurrence;

add the pair with the highest occurrence to the global dictionary byadding the localized word from the pair to a list of used localizedwords and adding the corresponding first language word to a list of usedfirst language words; and

select a next pair with the highest occurrence and repeating the processof adding the next pair to the global dictionary for each of theplurality of pairs, unless the localized word is in the list of usedlocalized words or the corresponding first language word is in the usedfirst language words list.

Item 18. The computer readable medium of items 16 or 17, whereincreating the first local dictionary includes:

-   -   dividing the first language resource into one or more words that        make up the first language resource;    -   pairing each of the one or more words with a translation        obtained from the global dictionary to obtain a plurality of        pairs to create a list of words in the local dictionary;    -   indexing the plurality of pairs;    -   dividing the localized software resource into one or more        localized words that make up the localized software resource;    -   determining if each of the one or more localized words are        included in at least one of the plurality of pairs;    -   when one of the one or more localized words are not included in        at least one of the plurality of pairs, locating an index for        the one of the one or more localized words in the global        dictionary; and    -   adding the one of the one or more localized words to the list of        words in the first local dictionary along with the index.

Item 19. The computer readable medium of any of the preceding items16-18, wherein compressing the localized software resource based on thefirst local dictionary includes:

setting a predetermined number of first bits in a compressed localizedresource to a number of bits necessary to store local indexes;

dividing the localized software resource into one or more localizedwords that make up the localized software resource;

for each of the one or more localized words, locating the word in thefirst local dictionary and adding a local index that corresponds to theword from the first local dictionary to the compressed localizedresource;

determining if the local index indicates the word does not include afirst language counterpart in the local dictionary; and

upon determining the local index indicates the word does not include thefirst language counterpart in the local dictionary, adding a globalindex for the word from the global dictionary to the compressedlocalized resource.

Item 20. The computer readable medium of any of the preceding items16-19, wherein the instructions further cause the programmable device todecompress the compressed localized resource to obtain a decompressedlocalized resource by:

creating a second local dictionary from the first language softwareresource;

reading bitness information from the compressed localized resource todetermine a specific number of bits used for each word in the compressedlocalized resource;

reading a next specific number of bits from the compressed localizedresource to determine a number of words in the decompressed localizedresource;

reading the next specific number of bits from the compressed localizedresource to determine if the next specific number of bits corresponds toan index in the second local dictionary;

when the next specific number of bits corresponds with the index, addinga translation corresponding to the index from the local dictionary tothe decompressed localized resource;

when the next specific number of bits does not correspond with theindex, reading a global index in the compressed localized resource,locating the global index in the global dictionary and inserting atranslation corresponding to the global index in the decompressedlocalized resource; and

applying linguistic rules to the decompressed localized resource.

While the foregoing has described what are considered to be the bestmode and/or other examples, it is understood that various modificationsmay be made therein and that the subject matter disclosed herein may beimplemented in various forms and examples, and that the teachings may beapplied in numerous applications, only some of which have been describedherein. It is intended by the following claims to claim any and allapplications, modifications and variations that fall within the truescope of the present teachings.

Unless otherwise stated, all measurements, values, ratings, positions,magnitudes, sizes, and other specifications that are set forth in thisspecification, including in the claims that follow, are approximate, notexact. They are intended to have a reasonable range that is consistentwith the functions to which they relate and with what is customary inthe art to which they pertain.

The scope of protection is limited solely by the claims that now follow.That scope is intended and should be interpreted to be as broad as isconsistent with the ordinary meaning of the language that is used in theclaims when interpreted in light of this specification and theprosecution history that follows, and to encompass all structural andfunctional equivalents. Notwithstanding, none of the claims are intendedto embrace subject matter that fails to satisfy the requirement ofSections 101, 102, or 103 of the Patent Act, nor should they beinterpreted in such a way. Any unintended embracement of such subjectmatter is hereby disclaimed.

Except as stated immediately above, nothing that has been stated orillustrated is intended or should be interpreted to cause a dedicationof any component, step, feature, object, benefit, advantage, orequivalent to the public, regardless of whether it is or is not recitedin the claims.

It will be understood that the terms and expressions used herein havethe ordinary meaning as is accorded to such terms and expressions withrespect to their corresponding respective areas of inquiry and studyexcept where specific meanings have otherwise been set forth herein.

Relational terms such as first and second and the like may be usedsolely to distinguish one entity or action from another withoutnecessarily requiring or implying any actual such relationship or orderbetween such entities or actions. The terms “comprises,” “comprising,”and any other variation thereof, are intended to cover a non-exclusiveinclusion, such that a process, method, article, or apparatus thatcomprises a list of elements does not include only those elements butmay include other elements not expressly listed or inherent to suchprocess, method, article, or apparatus. An element preceded by “a” or“an” does not, without further constraints, preclude the existence ofadditional identical elements in the process, method, article, orapparatus that comprises the element.

The Abstract of the Disclosure is provided to allow the reader toquickly identify the nature of the technical disclosure. It is submittedwith the understanding that it will not be used to interpret or limitthe scope or meaning of the claims. In addition, in the foregoingDetailed Description, it can be seen that various features are groupedtogether in various examples for the purpose of streamlining thedisclosure. This method of disclosure is not to be interpreted asreflecting an intention that any claim requires more features than theclaim expressly recites. Rather, as the following claims reflect,inventive subject matter lies in less than all features of a singledisclosed example. Thus, the following claims are hereby incorporatedinto the Detailed Description, with each claim standing on its own as aseparately claimed subject matter.

What is claimed is:
 1. A data processing system comprising: a processor;and a memory in communication with the processor, the memory comprisingexecutable instructions that, when executed by the processor, cause thedata processing system to perform functions of: receiving a softwareresource, the software resource being in a first language; receiving alocalized software resource for compression, the localized softwareresource being in a second language, the software resource in the firstlanguage being a counterpart of the localized software resource;creating a first local dictionary for the localized software resourcebased at least in part on one or more first language words in thesoftware resource and on pairs from a global dictionary; and compressingthe localized software resource based on the first local dictionary. 2.The data processing system of claim 1, wherein the executableinstructions when executed by the processor, further cause the dataprocessing system to perform functions of: creating the globaldictionary for an application by: examining a plurality of localizedsoftware resources in the application; dividing each of the plurality oflocalized software resources into one or more words that make up eachlocalized software resource; pair each of the one or more words with acorresponding first language word from a counterpart software resourceto obtain a plurality of pairs; initiating a counter for each pair andsetting the counter to one; if a pair is a repeat pair, increasing thecounter by one; sorting the plurality of pairs by occurrence; selectingthe pair with a highest occurrence; adding the pair with the highestoccurrence to the global dictionary by adding a localized word from thepair to a list of used localized words and adding the correspondingfirst language word to a list of used first language words; andselecting a next pair with the highest occurrence and repeating aprocess of adding the next pair to the global dictionary for each of theplurality of pairs, unless the localized word is in the list of usedlocalized words or the corresponding first language word is in the usedfirst language words list.
 3. The data processing system of claim 2,wherein creating the first local dictionary includes: dividing thesoftware resource into one or more words that make up the softwareresource; pairing each of the one or more words with a translationobtained from the global dictionary to obtain a plurality of pairs tocreate a list of words in the first local dictionary; indexing theplurality of pairs; dividing the localized software resource into one ormore localized words that make up the localized software resource;determining if each of the one or more localized words are included inat least one of the plurality of pairs; when one of the one or morelocalized words are not included in at least one of the plurality ofpairs, locating an index for the one of the one or more localized wordsin the global dictionary; and adding the one of the one or morelocalized words to the list of words in the first local dictionary alongwith the index.
 4. The data processing system of claim 1, whereincompressing the localized software resource based on the first localdictionary includes: setting a predetermined number of first bits in acompressed localized resource to a number of bits necessary to storelocal indexes; dividing the localized software resource into one or morelocalized words that make up the localized software resource; for eachof the one or more localized words, locating the word in the first localdictionary and adding a local index that corresponds to the word fromthe first local dictionary to the compressed localized resource;determining if the local index indicates the word does not include afirst language counterpart in the first local dictionary; and upondetermining the local index indicates the word does not include thefirst language counterpart in the first local dictionary, adding aglobal index for the word from the global dictionary to the compressedlocalized resource.
 5. The data processing system of claim 4, whereinthe executable instructions when executed by the processor, furthercause the data processing system to perform functions of decompressingthe compressed localized resource to obtain a decompressed localizedresource by: creating a second local dictionary from the softwareresource in the first language; reading bitness information from thecompressed localized resource to determine a specific number of bitsused for each word in the compressed localized resource; reading a nextspecific number of bits from the compressed localized resource todetermine a number of words in the decompressed localized resource;reading the next specific number of bits from the compressed localizedresource to determine if the next specific number of bits corresponds toan index in the second local dictionary; when the next specific numberof bits corresponds with the index, adding a translation correspondingto the index from the second local dictionary to the decompressedlocalized resource; when the next specific number of bits does notcorrespond with the index, reading a global index in the compressedlocalized resource, locating the global index in the global dictionaryand inserting a translation corresponding to the global index in thedecompressed localized resource; and applying linguistic rules to thedecompressed localized resource.
 6. The data processing system of claim1, wherein the executable instructions when executed by the processor,further cause the data processing system to perform functions ofremoving duplicate content.
 7. The data processing system of claim 1,wherein the executable instructions when executed by the processor,further cause the device to perform functions of removing first languagereplicas in the localized software resource.
 8. The data processingsystem of claim 1, wherein the executable instructions when executed bythe processor, further cause the data processing system to performfunctions of creating a file dictionary.
 9. The data processing systemof claim 8, wherein the executable instructions when executed by theprocessor, further cause the data processing system to perform functionsof performing deduplication after compressing the localized softwareresource.
 10. A method for compressing a localized software resource,comprising: receiving a software resource, the software resource beingin a first language; receiving the localized software resource forcompression, the localized software resource being in a second language,the software resource in the first language being a counterpart of thelocalized software resource in the second language; creating a firstlocal dictionary for the localized software resource based at least inpart on one or more first language words in the software resource andbased on pairs from a global dictionary; and compressing the localizedsoftware resource based on the first local dictionary.
 11. The method ofclaim 10, further comprising creating the global dictionary for anapplication by: examining a plurality of localized software resources inthe application; dividing each of the plurality of localized softwareresources into one or more words that make up each localized softwareresource; pair each of the one or more words with a corresponding firstlanguage word from a counterpart first language resource to obtain aplurality of pairs; initiating a counter for each pair and setting thecounter to one; if a pair is a repeat pair, increasing the counter byone; sorting the plurality of pairs by occurrence; selecting the pairwith the highest occurrence; adding the pair with the highest occurrenceto the global dictionary by adding the localized word from the pair to alist of used localized words and adding the corresponding first languageword to a list of used first language words; and selecting a next pairwith the highest occurrence and repeating a process of adding the nextpair to the global dictionary for each of the plurality of pairs, unlessthe localized word is in the list of used localized words or thecorresponding first language word is in the used first language wordslist.
 12. The method of claim 10, wherein creating the first localdictionary includes: dividing the software resource into one or morewords that make up the software resource; pairing each of the one ormore words with a translation obtained from the global dictionary toobtain a plurality of pairs to create a list of words in the first localdictionary; indexing the plurality of pairs; dividing the localizedsoftware resource into one or more localized words that make up thelocalized software resource; determining if each of the one or morelocalized words are included in at least one of the plurality of pairs;when one of the one or more localized words are not included in at leastone of the plurality of pairs, locating an index for the one of the oneor more localized words in the global dictionary; and adding the one ofthe one or more localized words to the list of words in the first localdictionary along with the index.
 13. The method of claim 10, whereincompressing the localized software resource based on the first localdictionary includes: setting a predetermined number of first bits in acompressed localized resource to a number of bits necessary to storelocal indexes; dividing the localized software resource into one or morelocalized words that make up the localized software resource; for eachof the one or more localized words, locating the word in the first localdictionary and adding a local index that corresponds to the word fromthe first local dictionary to the compressed localized resource;determining if the local index indicates the word does not include afirst language counterpart in the first local dictionary; and upondetermining the local index indicates the word does not include thefirst language counterpart in the first local dictionary, adding aglobal index for the word from the global dictionary to the compressedlocalized resource.
 14. The method of claim 13, further comprisingdecompressing the compressed localized resource to obtain a decompressedlocalized resource by: creating a second local dictionary from thesoftware resource; reading bitness information from the compressedlocalized resource to determine a specific number of bits used for eachword in the compressed localized resource; reading a next specificnumber of bits from the compressed localized resource to determine anumber of words in the decompressed localized resource; reading the nextspecific number of bits from the compressed localized resource todetermine if the next specific number of bits corresponds to an index inthe second local dictionary; when the next specific number of bitscorresponds with the index, adding a translation corresponding to theindex from the second local dictionary to the decompressed localizedresource; when the next specific number of bits does not correspond withthe index, reading a global index in the compressed localized resource,locating the global index in the global dictionary and inserting atranslation corresponding to the global index in the decompressedlocalized resource; and applying linguistic rules to the decompressedlocalized resource.
 15. The method of claim 10, further comprisingcreating a file dictionary.
 16. A non-transitory computer readablemedium on which are stored instructions that, when executed, cause aprogrammable device to: receive a software resource, the softwareresource being in a first language; receive a localized softwareresource for compression, the localized software resource being in asecond language, the software resource in the first language being acounterpart of the localized software resource in the second language;create a first local dictionary for the localized software resourcebased at least in part on one or more first language words in thesoftware resource and based on pairs from a global dictionary; andcompress the localized software resource based on the first localdictionary.
 17. The computer readable medium of claim 16, wherein theinstructions further cause the programmable device to create the globaldictionary for an application by: examining a plurality of localizedsoftware resources in the application; dividing each of the plurality oflocalized software resources into one or more words that make up eachlocalized software resource; pair each of the one or more words with acorresponding first language word from a counterpart first languageresource to obtain a plurality of pairs; initiate a counter for eachpair and setting the counter to one; if a pair is a repeat pair,increase the counter by one; sort the plurality of pairs by occurrence;select the pair with a highest occurrence; add the pair with the highestoccurrence to the global dictionary by adding the localized word fromthe pair to a list of used localized words and adding the correspondingfirst language word to a list of used first language words; and select anext pair with the highest occurrence and repeating a process of addingthe next pair to the global dictionary for each of the plurality ofpairs, unless the localized word is in the list of used localized wordsor the corresponding first language word is in the used first languagewords list.
 18. The computer readable medium of claim 16, whereincreating the first local dictionary includes: dividing the firstlanguage resource into one or more words that make up the first languageresource; pairing each of the one or more words with a translationobtained from the global dictionary to obtain a plurality of pairs tocreate a list of words in the first local dictionary; indexing theplurality of pairs; dividing the localized software resource into one ormore localized words that make up the localized software resource;determining if each of the one or more localized words are included inat least one of the plurality of pairs; when one of the one or morelocalized words are not included in at least one of the plurality ofpairs, locating an index for the one of the one or more localized wordsin the global dictionary; and adding the one of the one or morelocalized words to the list of words in the first local dictionary alongwith the index.
 19. The computer readable medium of claim 16, whereincompressing the localized software resource based on the first localdictionary includes: setting a predetermined number of first bits in acompressed localized resource to a number of bits necessary to storelocal indexes; dividing the localized software resource into one or morelocalized words that make up the localized software resource; for eachof the one or more localized words, locating the word in the first localdictionary and adding a local index that corresponds to the word fromthe first local dictionary to the compressed localized resource;determining if the local index indicates the word does not include afirst language counterpart in the first local dictionary; and upondetermining the local index indicates the word does not include thefirst language counterpart in the first local dictionary, adding aglobal index for the word from the global dictionary to the compressedlocalized resource.
 20. The computer readable medium of claim 19,wherein the instructions further cause the programmable device todecompress the compressed localized resource to obtain a decompressedlocalized resource by: creating a second local dictionary from thesoftware resource; reading bitness information from the compressedlocalized resource to determine a specific number of bits used for eachword in the compressed localized resource; reading a next specificnumber of bits from the compressed localized resource to determine anumber of words in the decompressed localized resource; reading the nextspecific number of bits from the compressed localized resource todetermine if the next specific number of bits corresponds to an index inthe second local dictionary; when the next specific number of bitscorresponds with the index, adding a translation corresponding to theindex from the second local dictionary to the decompressed localizedresource; when the next specific number of bits does not correspond withthe index, reading a global index in the compressed localized resource,locating the global index in the global dictionary and inserting atranslation corresponding to the global index in the decompressedlocalized resource; and applying linguistic rules to the decompressedlocalized resource.